ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
نویسندگان
چکیده
منابع مشابه
On semigroups with PSPACE-complete subpower membership problem
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) for S asks whether b can be generated by a1, . . . , ak. For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups wit...
متن کاملThe subpower membership problem for semigroups
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) asks whether b can be generated by a1, . . . , ak. If S is a finite group, then there is a folklore algorithm that decides this problem in time polynomial in nk. For semigroups this problem always lies in PSPACE. We show that the SMP for a full transformation semigroup on 3 o...
متن کاملThe Subpower Membership Problem for Mal'cEV Algebras
Given tuples a1, . . . , ak and b in A n for some algebraic structure A, the subpower membership problem asks whether b is in the subalgebra of An that is generated by a1, . . . , ak . For A a finite group, there is a folklore algorithm which decides this problem in time polynomial in n and k. We show that the subpower membership problem for any finite Mal’cev algebra is in NP and give a polyno...
متن کاملThe Subpower Membership Problem for Finite Algebras with Cube Terms
The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra. We consider a variant of this problem, which is motivated by recent progress in the Constraint Satisfaction Problem, and is often referred to as the Subpower Membership Problem (SMP). In the SMP...
متن کاملThe UAV Problem is PSPACE-Complete
Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target’s relative deadline? The uav Problem is the question of whether this task has a solution. This problem can st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 2018
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788718000010